Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → FROM(s(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X1)
PROPER(from(X)) → FROM(proper(X))
ACTIVE(fst(X1, X2)) → FST(active(X1), X2)
PROPER(len(X)) → LEN(proper(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X2)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(add(X1, X2)) → ACTIVE(X2)
ACTIVE(fst(s(X), cons(Y, Z))) → FST(X, Z)
TOP(mark(X)) → TOP(proper(X))
PROPER(len(X)) → PROPER(X)
ACTIVE(fst(s(X), cons(Y, Z))) → CONS(Y, fst(X, Z))
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(add(X1, X2)) → ADD(active(X1), X2)
ACTIVE(len(X)) → LEN(active(X))
TOP(ok(X)) → ACTIVE(X)
LEN(ok(X)) → LEN(X)
ACTIVE(add(X1, X2)) → ADD(X1, active(X2))
PROPER(s(X)) → PROPER(X)
ACTIVE(fst(X1, X2)) → FST(X1, active(X2))
ACTIVE(add(s(X), Y)) → ADD(X, Y)
FST(X1, mark(X2)) → FST(X1, X2)
TOP(mark(X)) → PROPER(X)
ADD(mark(X1), X2) → ADD(X1, X2)
PROPER(fst(X1, X2)) → PROPER(X2)
ACTIVE(add(X1, X2)) → ACTIVE(X1)
PROPER(fst(X1, X2)) → FST(proper(X1), proper(X2))
PROPER(add(X1, X2)) → PROPER(X1)
PROPER(add(X1, X2)) → ADD(proper(X1), proper(X2))
PROPER(s(X)) → S(proper(X))
S(ok(X)) → S(X)
PROPER(fst(X1, X2)) → PROPER(X1)
ACTIVE(len(cons(X, Z))) → S(len(Z))
CONS(mark(X1), X2) → CONS(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
LEN(mark(X)) → LEN(X)
ADD(ok(X1), ok(X2)) → ADD(X1, X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(len(cons(X, Z))) → LEN(Z)
FST(ok(X1), ok(X2)) → FST(X1, X2)
PROPER(add(X1, X2)) → PROPER(X2)
ACTIVE(len(X)) → ACTIVE(X)
ACTIVE(from(X)) → S(X)
ADD(X1, mark(X2)) → ADD(X1, X2)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
FST(mark(X1), X2) → FST(X1, X2)
PROPER(cons(X1, X2)) → PROPER(X2)
ACTIVE(from(X)) → ACTIVE(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
FROM(ok(X)) → FROM(X)
ACTIVE(add(s(X), Y)) → S(add(X, Y))

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → FROM(s(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X1)
PROPER(from(X)) → FROM(proper(X))
ACTIVE(fst(X1, X2)) → FST(active(X1), X2)
PROPER(len(X)) → LEN(proper(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X2)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(add(X1, X2)) → ACTIVE(X2)
ACTIVE(fst(s(X), cons(Y, Z))) → FST(X, Z)
TOP(mark(X)) → TOP(proper(X))
PROPER(len(X)) → PROPER(X)
ACTIVE(fst(s(X), cons(Y, Z))) → CONS(Y, fst(X, Z))
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(add(X1, X2)) → ADD(active(X1), X2)
ACTIVE(len(X)) → LEN(active(X))
TOP(ok(X)) → ACTIVE(X)
LEN(ok(X)) → LEN(X)
ACTIVE(add(X1, X2)) → ADD(X1, active(X2))
PROPER(s(X)) → PROPER(X)
ACTIVE(fst(X1, X2)) → FST(X1, active(X2))
ACTIVE(add(s(X), Y)) → ADD(X, Y)
FST(X1, mark(X2)) → FST(X1, X2)
TOP(mark(X)) → PROPER(X)
ADD(mark(X1), X2) → ADD(X1, X2)
PROPER(fst(X1, X2)) → PROPER(X2)
ACTIVE(add(X1, X2)) → ACTIVE(X1)
PROPER(fst(X1, X2)) → FST(proper(X1), proper(X2))
PROPER(add(X1, X2)) → PROPER(X1)
PROPER(add(X1, X2)) → ADD(proper(X1), proper(X2))
PROPER(s(X)) → S(proper(X))
S(ok(X)) → S(X)
PROPER(fst(X1, X2)) → PROPER(X1)
ACTIVE(len(cons(X, Z))) → S(len(Z))
CONS(mark(X1), X2) → CONS(X1, X2)
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
LEN(mark(X)) → LEN(X)
ADD(ok(X1), ok(X2)) → ADD(X1, X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(len(cons(X, Z))) → LEN(Z)
FST(ok(X1), ok(X2)) → FST(X1, X2)
PROPER(add(X1, X2)) → PROPER(X2)
ACTIVE(len(X)) → ACTIVE(X)
ACTIVE(from(X)) → S(X)
ADD(X1, mark(X2)) → ADD(X1, X2)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
TOP(ok(X)) → TOP(active(X))
PROPER(from(X)) → PROPER(X)
FST(mark(X1), X2) → FST(X1, X2)
PROPER(cons(X1, X2)) → PROPER(X2)
ACTIVE(from(X)) → ACTIVE(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
FROM(ok(X)) → FROM(X)
ACTIVE(add(s(X), Y)) → S(add(X, Y))

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

PROPER(from(X)) → FROM(proper(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → FROM(s(X))
ACTIVE(fst(X1, X2)) → FST(active(X1), X2)
PROPER(len(X)) → LEN(proper(X))
ACTIVE(fst(X1, X2)) → ACTIVE(X2)
ACTIVE(from(X)) → FROM(active(X))
ACTIVE(add(X1, X2)) → ACTIVE(X2)
ACTIVE(fst(s(X), cons(Y, Z))) → FST(X, Z)
TOP(mark(X)) → TOP(proper(X))
PROPER(len(X)) → PROPER(X)
ACTIVE(fst(s(X), cons(Y, Z))) → CONS(Y, fst(X, Z))
FROM(mark(X)) → FROM(X)
PROPER(cons(X1, X2)) → PROPER(X1)
ACTIVE(add(X1, X2)) → ADD(active(X1), X2)
ACTIVE(len(X)) → LEN(active(X))
TOP(ok(X)) → ACTIVE(X)
LEN(ok(X)) → LEN(X)
PROPER(s(X)) → PROPER(X)
ACTIVE(add(X1, X2)) → ADD(X1, active(X2))
ACTIVE(fst(X1, X2)) → FST(X1, active(X2))
ACTIVE(add(s(X), Y)) → ADD(X, Y)
FST(X1, mark(X2)) → FST(X1, X2)
ADD(mark(X1), X2) → ADD(X1, X2)
TOP(mark(X)) → PROPER(X)
PROPER(fst(X1, X2)) → PROPER(X2)
ACTIVE(add(X1, X2)) → ACTIVE(X1)
PROPER(fst(X1, X2)) → FST(proper(X1), proper(X2))
PROPER(add(X1, X2)) → PROPER(X1)
PROPER(add(X1, X2)) → ADD(proper(X1), proper(X2))
PROPER(s(X)) → S(proper(X))
S(ok(X)) → S(X)
PROPER(fst(X1, X2)) → PROPER(X1)
ACTIVE(len(cons(X, Z))) → S(len(Z))
ACTIVE(from(X)) → CONS(X, from(s(X)))
CONS(mark(X1), X2) → CONS(X1, X2)
LEN(mark(X)) → LEN(X)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
ADD(ok(X1), ok(X2)) → ADD(X1, X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
FST(ok(X1), ok(X2)) → FST(X1, X2)
ACTIVE(len(cons(X, Z))) → LEN(Z)
PROPER(add(X1, X2)) → PROPER(X2)
ACTIVE(len(X)) → ACTIVE(X)
ADD(X1, mark(X2)) → ADD(X1, X2)
ACTIVE(from(X)) → S(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(from(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
PROPER(cons(X1, X2)) → PROPER(X2)
FST(mark(X1), X2) → FST(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(from(X)) → ACTIVE(X)
FROM(ok(X)) → FROM(X)
ACTIVE(add(s(X), Y)) → S(add(X, Y))

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 9 SCCs with 24 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


S(ok(X)) → S(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
S(x1)  =  S(x1)
ok(x1)  =  ok(x1)

Recursive path order with status [2].
Precedence:
ok1 > S1

Status:
ok1: multiset
S1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LEN(mark(X)) → LEN(X)
LEN(ok(X)) → LEN(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LEN(mark(X)) → LEN(X)
The remaining pairs can at least be oriented weakly.

LEN(ok(X)) → LEN(X)
Used ordering: Combined order from the following AFS and order.
LEN(x1)  =  LEN(x1)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive path order with status [2].
Precedence:
trivial

Status:
mark1: multiset
LEN1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LEN(ok(X)) → LEN(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


LEN(ok(X)) → LEN(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
LEN(x1)  =  LEN(x1)
ok(x1)  =  ok(x1)

Recursive path order with status [2].
Precedence:
ok1 > LEN1

Status:
ok1: multiset
LEN1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD(X1, mark(X2)) → ADD(X1, X2)
ADD(mark(X1), X2) → ADD(X1, X2)
ADD(ok(X1), ok(X2)) → ADD(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ADD(ok(X1), ok(X2)) → ADD(X1, X2)
The remaining pairs can at least be oriented weakly.

ADD(X1, mark(X2)) → ADD(X1, X2)
ADD(mark(X1), X2) → ADD(X1, X2)
Used ordering: Combined order from the following AFS and order.
ADD(x1, x2)  =  ADD(x1)
mark(x1)  =  x1
ok(x1)  =  ok(x1)

Recursive path order with status [2].
Precedence:
trivial

Status:
ADD1: multiset
ok1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD(X1, mark(X2)) → ADD(X1, X2)
ADD(mark(X1), X2) → ADD(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ADD(mark(X1), X2) → ADD(X1, X2)
The remaining pairs can at least be oriented weakly.

ADD(X1, mark(X2)) → ADD(X1, X2)
Used ordering: Combined order from the following AFS and order.
ADD(x1, x2)  =  ADD(x1)
mark(x1)  =  mark(x1)

Recursive path order with status [2].
Precedence:
mark1 > ADD1

Status:
mark1: multiset
ADD1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ADD(X1, mark(X2)) → ADD(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ADD(X1, mark(X2)) → ADD(X1, X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
ADD(x1, x2)  =  ADD(x1, x2)
mark(x1)  =  mark(x1)

Recursive path order with status [2].
Precedence:
mark1 > ADD2

Status:
mark1: multiset
ADD2: [1,2]

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
QDP
                            ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(mark(X)) → FROM(X)
FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FROM(mark(X)) → FROM(X)
The remaining pairs can at least be oriented weakly.

FROM(ok(X)) → FROM(X)
Used ordering: Combined order from the following AFS and order.
FROM(x1)  =  FROM(x1)
mark(x1)  =  mark(x1)
ok(x1)  =  x1

Recursive path order with status [2].
Precedence:
trivial

Status:
mark1: multiset
FROM1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FROM(ok(X)) → FROM(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FROM(ok(X)) → FROM(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
FROM(x1)  =  FROM(x1)
ok(x1)  =  ok(x1)

Recursive path order with status [2].
Precedence:
ok1 > FROM1

Status:
ok1: multiset
FROM1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FST(ok(X1), ok(X2)) → FST(X1, X2)
FST(mark(X1), X2) → FST(X1, X2)
FST(X1, mark(X2)) → FST(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FST(mark(X1), X2) → FST(X1, X2)
The remaining pairs can at least be oriented weakly.

FST(ok(X1), ok(X2)) → FST(X1, X2)
FST(X1, mark(X2)) → FST(X1, X2)
Used ordering: Combined order from the following AFS and order.
FST(x1, x2)  =  FST(x1)
ok(x1)  =  x1
mark(x1)  =  mark(x1)

Recursive path order with status [2].
Precedence:
trivial

Status:
mark1: multiset
FST1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FST(ok(X1), ok(X2)) → FST(X1, X2)
FST(X1, mark(X2)) → FST(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FST(ok(X1), ok(X2)) → FST(X1, X2)
The remaining pairs can at least be oriented weakly.

FST(X1, mark(X2)) → FST(X1, X2)
Used ordering: Combined order from the following AFS and order.
FST(x1, x2)  =  FST(x1)
ok(x1)  =  ok(x1)
mark(x1)  =  mark

Recursive path order with status [2].
Precedence:
ok1 > FST1
mark > FST1

Status:
FST1: multiset
ok1: multiset
mark: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

FST(X1, mark(X2)) → FST(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


FST(X1, mark(X2)) → FST(X1, X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
FST(x1, x2)  =  FST(x1, x2)
mark(x1)  =  mark(x1)

Recursive path order with status [2].
Precedence:
mark1 > FST2

Status:
mark1: multiset
FST2: [1,2]

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
QDP
                            ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


CONS(ok(X1), ok(X2)) → CONS(X1, X2)
The remaining pairs can at least be oriented weakly.

CONS(mark(X1), X2) → CONS(X1, X2)
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2)  =  CONS(x1)
mark(x1)  =  x1
ok(x1)  =  ok(x1)

Recursive path order with status [2].
Precedence:
trivial

Status:
CONS1: multiset
ok1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


CONS(mark(X1), X2) → CONS(X1, X2)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2)  =  CONS(x1)
mark(x1)  =  mark(x1)

Recursive path order with status [2].
Precedence:
mark1 > CONS1

Status:
mark1: multiset
CONS1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(add(X1, X2)) → PROPER(X1)
PROPER(fst(X1, X2)) → PROPER(X2)
PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(len(X)) → PROPER(X)
PROPER(fst(X1, X2)) → PROPER(X1)
PROPER(add(X1, X2)) → PROPER(X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER(add(X1, X2)) → PROPER(X1)
PROPER(fst(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(fst(X1, X2)) → PROPER(X1)
PROPER(add(X1, X2)) → PROPER(X2)
The remaining pairs can at least be oriented weakly.

PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(len(X)) → PROPER(X)
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
add(x1, x2)  =  add(x1, x2)
fst(x1, x2)  =  fst(x1, x2)
s(x1)  =  x1
from(x1)  =  x1
cons(x1, x2)  =  cons(x1, x2)
len(x1)  =  x1

Recursive path order with status [2].
Precedence:
add2 > PROPER1
fst2 > PROPER1
cons2 > PROPER1

Status:
fst2: multiset
PROPER1: multiset
add2: multiset
cons2: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(s(X)) → PROPER(X)
PROPER(from(X)) → PROPER(X)
PROPER(len(X)) → PROPER(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER(s(X)) → PROPER(X)
The remaining pairs can at least be oriented weakly.

PROPER(from(X)) → PROPER(X)
PROPER(len(X)) → PROPER(X)
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
s(x1)  =  s(x1)
from(x1)  =  x1
len(x1)  =  x1

Recursive path order with status [2].
Precedence:
s1 > PROPER1

Status:
PROPER1: multiset
s1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(from(X)) → PROPER(X)
PROPER(len(X)) → PROPER(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER(from(X)) → PROPER(X)
The remaining pairs can at least be oriented weakly.

PROPER(len(X)) → PROPER(X)
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
from(x1)  =  from(x1)
len(x1)  =  x1

Recursive path order with status [2].
Precedence:
trivial

Status:
from1: multiset
PROPER1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
QDP
                            ↳ QDPOrderProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(len(X)) → PROPER(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


PROPER(len(X)) → PROPER(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PROPER(x1)  =  PROPER(x1)
len(x1)  =  len(x1)

Recursive path order with status [2].
Precedence:
len1 > PROPER1

Status:
len1: multiset
PROPER1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
                          ↳ QDP
                            ↳ QDPOrderProof
QDP
                                ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(len(X)) → ACTIVE(X)
ACTIVE(fst(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(add(X1, X2)) → ACTIVE(X1)
ACTIVE(fst(X1, X2)) → ACTIVE(X2)
ACTIVE(from(X)) → ACTIVE(X)
ACTIVE(add(X1, X2)) → ACTIVE(X2)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE(fst(X1, X2)) → ACTIVE(X1)
ACTIVE(add(X1, X2)) → ACTIVE(X1)
ACTIVE(fst(X1, X2)) → ACTIVE(X2)
ACTIVE(add(X1, X2)) → ACTIVE(X2)
The remaining pairs can at least be oriented weakly.

ACTIVE(len(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
len(x1)  =  x1
fst(x1, x2)  =  fst(x1, x2)
cons(x1, x2)  =  x1
add(x1, x2)  =  add(x1, x2)
from(x1)  =  x1

Recursive path order with status [2].
Precedence:
fst2 > ACTIVE1
add2 > ACTIVE1

Status:
fst2: multiset
ACTIVE1: multiset
add2: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(len(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE(len(X)) → ACTIVE(X)
The remaining pairs can at least be oriented weakly.

ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
len(x1)  =  len(x1)
cons(x1, x2)  =  x1
from(x1)  =  x1

Recursive path order with status [2].
Precedence:
len1 > ACTIVE1

Status:
len1: multiset
ACTIVE1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ QDPOrderProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(from(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE(cons(X1, X2)) → ACTIVE(X1)
The remaining pairs can at least be oriented weakly.

ACTIVE(from(X)) → ACTIVE(X)
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
cons(x1, x2)  =  cons(x1, x2)
from(x1)  =  x1

Recursive path order with status [2].
Precedence:
cons2 > ACTIVE1

Status:
ACTIVE1: multiset
cons2: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
QDP
                            ↳ QDPOrderProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(from(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


ACTIVE(from(X)) → ACTIVE(X)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  ACTIVE(x1)
from(x1)  =  from(x1)

Recursive path order with status [2].
Precedence:
from1 > ACTIVE1

Status:
from1: multiset
ACTIVE1: multiset

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
                      ↳ QDP
                        ↳ QDPOrderProof
                          ↳ QDP
                            ↳ QDPOrderProof
QDP
                                ↳ PisEmptyProof
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


TOP(mark(X)) → TOP(proper(X))
The remaining pairs can at least be oriented weakly.

TOP(ok(X)) → TOP(active(X))
Used ordering: Combined order from the following AFS and order.
TOP(x1)  =  TOP(x1)
ok(x1)  =  x1
active(x1)  =  x1
mark(x1)  =  mark(x1)
proper(x1)  =  x1
add(x1, x2)  =  add(x1, x2)
len(x1)  =  len(x1)
nil  =  nil
0  =  0
cons(x1, x2)  =  x1
s(x1)  =  s
from(x1)  =  from(x1)
fst(x1, x2)  =  fst(x1, x2)

Recursive path order with status [2].
Precedence:
add2 > s > fst2 > mark1
add2 > s > fst2 > nil
len1 > 0 > mark1
len1 > 0 > nil
len1 > s > fst2 > mark1
len1 > s > fst2 > nil
from1 > s > fst2 > mark1
from1 > s > fst2 > nil

Status:
len1: [1]
from1: multiset
fst2: [2,1]
mark1: [1]
add2: [1,2]
0: multiset
TOP1: [1]
s: []
nil: multiset

The following usable rules [14] were oriented:

add(mark(X1), X2) → mark(add(X1, X2))
active(len(nil)) → mark(0)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
active(add(X1, X2)) → add(active(X1), X2)
active(add(s(X), Y)) → mark(s(add(X, Y)))
proper(0) → ok(0)
s(ok(X)) → ok(s(X))
from(ok(X)) → ok(from(X))
active(add(X1, X2)) → add(X1, active(X2))
active(add(0, X)) → mark(X)
proper(s(X)) → s(proper(X))
len(mark(X)) → mark(len(X))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
active(fst(X1, X2)) → fst(active(X1), X2)
active(len(X)) → len(active(X))
add(X1, mark(X2)) → mark(add(X1, X2))
proper(nil) → ok(nil)
active(from(X)) → from(active(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
proper(len(X)) → len(proper(X))
active(len(cons(X, Z))) → mark(s(len(Z)))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(fst(0, Z)) → mark(nil)
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
active(cons(X1, X2)) → cons(active(X1), X2)
cons(mark(X1), X2) → mark(cons(X1, X2))
proper(from(X)) → from(proper(X))
from(mark(X)) → mark(from(X))
active(from(X)) → mark(cons(X, from(s(X))))
len(ok(X)) → ok(len(X))
active(fst(X1, X2)) → fst(X1, active(X2))
proper(add(X1, X2)) → add(proper(X1), proper(X2))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
QDP
                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(X)) → TOP(active(X))

The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


TOP(ok(X)) → TOP(active(X))
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
TOP(x1)  =  x1
ok(x1)  =  ok(x1)
active(x1)  =  x1
len(x1)  =  len(x1)
nil  =  nil
mark(x1)  =  mark
0  =  0
add(x1, x2)  =  x1
s(x1)  =  x1
from(x1)  =  from(x1)
fst(x1, x2)  =  fst(x2)
cons(x1, x2)  =  cons(x2)

Recursive path order with status [2].
Precedence:
len1 > ok1 > mark
len1 > 0 > nil > mark
from1 > ok1 > mark
cons1 > fst1 > ok1 > mark
cons1 > fst1 > nil > mark

Status:
from1: multiset
len1: multiset
fst1: [1]
0: multiset
ok1: multiset
nil: multiset
cons1: [1]
mark: multiset

The following usable rules [14] were oriented:

active(len(nil)) → mark(0)
add(mark(X1), X2) → mark(add(X1, X2))
active(add(X1, X2)) → add(active(X1), X2)
active(add(s(X), Y)) → mark(s(add(X, Y)))
from(ok(X)) → ok(from(X))
active(add(X1, X2)) → add(X1, active(X2))
active(add(0, X)) → mark(X)
len(mark(X)) → mark(len(X))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
active(fst(X1, X2)) → fst(active(X1), X2)
active(len(X)) → len(active(X))
add(X1, mark(X2)) → mark(add(X1, X2))
active(from(X)) → from(active(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
active(len(cons(X, Z))) → mark(s(len(Z)))
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
active(fst(0, Z)) → mark(nil)
fst(mark(X1), X2) → mark(fst(X1, X2))
active(cons(X1, X2)) → cons(active(X1), X2)
cons(mark(X1), X2) → mark(cons(X1, X2))
active(from(X)) → mark(cons(X, from(s(X))))
from(mark(X)) → mark(from(X))
len(ok(X)) → ok(len(X))
active(fst(X1, X2)) → fst(X1, active(X2))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ EdgeDeletionProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPOrderProof
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active(fst(0, Z)) → mark(nil)
active(fst(s(X), cons(Y, Z))) → mark(cons(Y, fst(X, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
active(add(0, X)) → mark(X)
active(add(s(X), Y)) → mark(s(add(X, Y)))
active(len(nil)) → mark(0)
active(len(cons(X, Z))) → mark(s(len(Z)))
active(cons(X1, X2)) → cons(active(X1), X2)
active(fst(X1, X2)) → fst(active(X1), X2)
active(fst(X1, X2)) → fst(X1, active(X2))
active(from(X)) → from(active(X))
active(add(X1, X2)) → add(active(X1), X2)
active(add(X1, X2)) → add(X1, active(X2))
active(len(X)) → len(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
fst(mark(X1), X2) → mark(fst(X1, X2))
fst(X1, mark(X2)) → mark(fst(X1, X2))
from(mark(X)) → mark(from(X))
add(mark(X1), X2) → mark(add(X1, X2))
add(X1, mark(X2)) → mark(add(X1, X2))
len(mark(X)) → mark(len(X))
proper(0) → ok(0)
proper(s(X)) → s(proper(X))
proper(nil) → ok(nil)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(fst(X1, X2)) → fst(proper(X1), proper(X2))
proper(from(X)) → from(proper(X))
proper(add(X1, X2)) → add(proper(X1), proper(X2))
proper(len(X)) → len(proper(X))
s(ok(X)) → ok(s(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
fst(ok(X1), ok(X2)) → ok(fst(X1, X2))
from(ok(X)) → ok(from(X))
add(ok(X1), ok(X2)) → ok(add(X1, X2))
len(ok(X)) → ok(len(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.